The dimension and minimum distance of two classes of primitive BCH codes

Reed-Solomon codes, a type of BCH codes, are widely employed in communication systems, storage devices and consumer electronics. This fact demonstrates the importance of BCH codes – a family of cyclic codes – in practice. In theory, BCH codes are among the best cyclic codes in terms of their error-correcting capability. A subclass of BCH codes are the narrow-sense primitive BCH codes. However, the dimension and minimum distance of these codes are not known in general. The objective of this paper is to determine the dimension and minimum distances of two classes of narrow-sense primitive BCH codes with design distances δ= (q−1)qm−1−1−q⌊(m−1)/2⌋ and δ = (q− 1)qm−1 − 1− q⌊(m+1)/2⌋. The weight distributions of some of these BCH codes are also reported. As will be seen, the two classes of BCH codes are sometimes optimal and sometimes among the best linear codes known. Index Terms BCH codes, cyclic codes, linear codes, secret sharing, weight distribution, weight enumerator.